منابع مشابه
Finite Idempotent Inverse Monoid Presentations
Several decidability problems for finite idempotent presentations of inverse monoids are solved, giving also insight into their structure. Besides providing a new elementary solution for the problem, solutions are obtained for the following problems: computing the maximal subgroups, being combinatorial, being semisimple, being fundamental, having infinite D-classes. The word problem for the lea...
متن کاملThe Free AMPLE Monoid
We show that the free weakly E-ample monoid on a set X is a full submonoid of the free inverse monoid FIM(X) on X . Consequently, it is ample, and so coincides with both the free weakly ample and the free ample monoid FAM(X) on X . We introduce the notion of a semidirect product Y ∗ T of a monoid T acting doubly on a semilattice Y with identity. We argue that the free monoid X∗ acts doubly on t...
متن کاملComparing semigroup and monoid presentations for finite monoids
It is known that for any finite group G given by a finite group presentation 〈A |R 〉 there exists a finite semigroup presentation 〈 B | Q 〉 for G of the same deficiency, i.e. satisfying |Q| − |B| = |R| − |A|. It is also known that the analogous statement does not hold for all finite monoids. In this paper we give a necessary and sufficient condition for a finite monoid M , given by a finite mon...
متن کاملTest Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid
It is shown that for every context free language L there effectively exists a test set F, that is, a finite subset F of L such that, for any pair (g, h) of morphisms, g(x) = h(x) for all x in F implies g(x) = h(x) for all x in L. This result was claimed earlier but a detailed correct proof is given here. Together with very recent results on systems of equations over a free monoid this result im...
متن کاملFundamental Groups, Inverse Sch Utzenberger Automata, and Monoid Presentations
This paper gives decidable conditions for when a nitely generated subgroup of a free group is the fundamental group of a Sch utzenberger automaton corresponding to a monoid presentation of an inverse monoid. Also, generalizations are given to speciic types of inverse monoids as well as to monoids which are \nearly inverse." This result has applications to computing membership for inverse monoid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hacettepe Journal of Mathematics and Statistics
سال: 2014
ISSN: 1303-5010
DOI: 10.15672/hjms.2014437522